Mathematical model of stored logic based computation
نویسندگان
چکیده
منابع مشابه
Computation Tree Logic Model Checking Based on Possibility Measures
In order to deal with the systematic verification with uncertain infromation in possibility theory, Li and Li [19] introduced model checking of linear-time properties in which the uncertainty is modeled by possibility measures. Xue, Lei and Li [26] defined computation tree logic (CTL) based on possibility measures, which is called possibilistic CTL (PoCTL). This paper is a continuation of the a...
متن کاملA Continuous Model of Computation Real-world Phenomena Computer Simulation Mathematical Model Model of Computation
Although the Turing-machine model of computation is widely used in computer science it is fundamentally inadequate as a foundation for the theory of modern scientific computation. The real-number model is described as an alternative. Physicists often choose continuous mathematical models for problems ranging from the dynamical systems of classical physics to the operator equations and path inte...
متن کاملMathematical Logic Homogenizable structures and model completeness
A homogenizable structure M is a structure where we may add a finite number of new relational symbols to represent some ∅−definable relations in order to make the structure homogeneous. In this article we will divide the homogenizable structures into different classes which categorize many known examples and show what makes each class important. We will show that model completeness is vital for...
متن کاملModel Checking Extended Computation Tree Logic
Computation Tree Logic is widely used for modelling the behaviour of simple systems over time, but its expressive power is limited. More powerful logics such as CTL* and the modal mu-calculus have the disadvantage that their model-checking problems are comparatively intractable, and they can be unintuitive. A recent contribution by Axelsson et al. introduces the `Extended CTL' family of logics,...
متن کاملModel Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such entities through computation steps, since this requires the ability to freely mix quantification and temporal operators. In this paper we study Quantified Computation Tree Logic (QCTL), which extends the well-known p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2010
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2010.02.034